'Single Cycle' Languages: Empirical Evidence for TAG-Adjoining
نویسنده
چکیده
Russian and Polish lack ’unbounded’ syntactic dependencies that fall into the primary empirical domain of TAG-Adjoining, namely, long-distance movement/filler-gap dependencies across a tensed clause boundary. A theory that incorporates Adjoining as a recursive structure building device provides a novel and straightforward account of this gap, whereas existing theories of syntactic locality, e.g. of the standard Minimalist kind, face difficulties explaining the phenomenon. These languages thus supply direct linguistic evidence for Adjoining.
منابع مشابه
Using synchronous tree adjoining grammar to model the typology of bound variable pronouns
This paper presents a novel analysis of bound variable anaphora using Synchronous Tree Adjoining Grammar (STAG), a pairing of a Tree Adjoining Grammar (TAG) for syntax and a TAG for semantics. While a bound variable pronoun can occur at a distance from its binder, as in ‘Every girli believes that shei is intelligent,’ languages vary, though in a limited way, as to how near or far from its binde...
متن کاملGenerating Parallel Multilingual LFG-TAG Grammars from a MetaGrammar
We introduce a MetaGrammar, which allows us to automatically generate, from a single and compact MetaGrammar hierarchy, parallel Lexical Functional Grammars (LFG) and Tree-Adjoining Grammars (TAG) for French and for English: the grammar writer specifies in compact manner syntactic properties that are potentially framework-, and to some extent language-independent (such as subcategorization, val...
متن کاملRelating Tabular Parsing Algorithms for Lig and Tag
Tree Adjoining Grammars (TAG) and Linear Indexed Grammars (LIG) are extensions of Context Free Grammars that generate the class of Tree Adjoining Languages. Taking advantage of this property, and providing a method for translating a TAG into a LIG, we define several parsing algorithms for TAG on the basis of their equivalent LIG parsers. We also explore why some practical optimizations for TAG ...
متن کاملOn the Generative Power of Grammars for RNA Secondary Structure
Several grammars have been proposed for representing RNA secondary structure including pseudoknots such as simple linear tree adjoining grammar (sl-tag), extended sl-tag (esl-tag) and RNA pseudoknot grammar (rpg). The main purpose of this paper is to compare the generative power of these grammars by identifying them as subclasses of multiple context-free grammars (mcfg). Specifically, it is sho...
متن کاملA Predictive Left-Corner Parser for Tree Adjoining Grammars
Tree Adjoining Grammar (TAG) is a formalism that has become very popular for the description of natural languages. However, the parsers for TAG that have been defined on the basis of the Earley’s algorithm entail important computational costs. In this article, we propose to extend the left corner relation from Context Free Grammar (CFG) to TAG in order to define an efficient left corner parser ...
متن کامل